A Test for the Stability of Networks

نویسندگان

  • Agnieszka Rowinska-Schwarzweller
  • Christoph Schwarzweller
چکیده

A complex polynomial is called a Hurwitz polynomial, if all its roots have a real part smaller than zero. This kind of polynomial plays an all-dominant role in stability checks of electrical (analog or digital) networks. In this article we prove that a polynomial p can be shown to be Hurwitz by checking whether the rational function e(p)/o(p) can be realized as a reactance one port, that is as an electrical impedance or admittance consisting of inductors and capacitors. Here e(p) and o(p) denote the even and the odd part of p [25].

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

بررسی پایداری حالت همگام در شبکه‌ای از نگاشت‌های آشوبناک با روش سنجه ماتریسی

Stability of synchronous state is a fundamental problem in synchronization. We study Matrix Measure as an approach for investigating of stability of synchronous states of chaotic maps on complex networks. Matrix Measure is a measure which depends on network structure. Using this measure and comparing with synchronization threshold which depends on the function of the map, show us how the synchr...

متن کامل

Third-order Decentralized Safe Consensus Protocol for Inter-connected Heterogeneous Vehicular Platoons

In this paper, the stability analysis and control design of heterogeneous traffic flow is considered. It is assumed that the traffic flow consists of infinite number of cooperative non-identical vehicular platoons. Two different networks are investigated in stability analysis of heterogeneous traffic flow: 1) inter-platoon network which deals with the communication topology of lead vehicles and...

متن کامل

Design of H� Congestion Controller for TCP Networks Based on LMI Formulation

In this paper, a state feedback H¥ controller is proposed in order to design an active queue management (AQM) system based on congestion control algorithm for networks supporting TCP protocols. In this approach, the available link bandwidth is modeled as a time-variant disturbance. The purpose of this paper is to design a controller which is capable of achieving the queue size and can guarantee...

متن کامل

Robust stability of fuzzy Markov type Cohen-Grossberg neural networks by delay decomposition approach

In this paper, we investigate the delay-dependent robust stability of fuzzy Cohen-Grossberg neural networks with Markovian jumping parameter and mixed time varying delays by delay decomposition method. A new Lyapunov-Krasovskii functional (LKF) is constructed by nonuniformly dividing discrete delay interval into multiple subinterval, and choosing proper functionals with different weighting matr...

متن کامل

A Survey on Stability Measure of Networks

In this paper we discuss about tenacity and its properties in stability calculation. We indicate relationships between tenacity and connectivity, tenacity and binding number, tenacity and toughness. We also give good lower and upper bounds for tenacity.

متن کامل

Robust stability of stochastic fuzzy impulsive recurrent neural networks with\ time-varying delays

In this paper, global robust stability of stochastic impulsive recurrent neural networks with time-varyingdelays which are represented by the Takagi-Sugeno (T-S) fuzzy models is considered. A novel Linear Matrix Inequality (LMI)-based stability criterion is obtained by using Lyapunov functional theory to guarantee the asymptotic stability of uncertain fuzzy stochastic impulsive recurrent neural...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Formalized Mathematics

دوره 21  شماره 

صفحات  -

تاریخ انتشار 2013